منابع مشابه
Personal reminiscences and remarks on the mathematical work of Tibor Gallai
Tibor Gallai is my oldest friend . We met more than 52 years ago, and we had our first long mathematical discussion in the summer of 1930 . Our friendship and collaboration started then, and no doubt will last until one of us "leaves" . I still remember that I learned from him at this occasion the beautiful proof of Jacob Steiner for the isoperimetric property of the circle . He pointed out to ...
متن کاملGallai and anti-Gallai graphs
This chapter deals with two graph classes the Gallai graphs and the anti-Gallai graphs. \Ve construct infinitely many pairs of graphs G and H such that f( G) = r( H). The existence of a finite family offorbidden subgraphs for the Gallai graphs and the ant.i-Gallai graphs to be H-frce, for any fillit.e graph H is proved and the forbidden subgraph characterizations of G for which the Gallai graph...
متن کاملTibor Beres
s. Proceedings of the American Informatics Association, 464-468. Oxford English Dictionary. Second Edition 1989. Accessed through the UNC – ChapelHill Libraries Digital Resources on November 7, 2007, fromhttp://dictionary.oed.com.libproxy.lib.unc.edu/cgi/entry/50000218. Mason, R. A, & Just, M. A. (2007). Lexical ambiguity in sentence comprehension.Brainresearch, 1146, 115-127.
متن کاملGallai graphs and anti-Gallai graphs
The Gallai graph and the anti-Gallai graph of a graph G have the edges of G as their vertices. Two edges of G are adjacent in the Gallai graph of G if they are incident but do not span a triangle in G; they are adjacent in the anti-Gallai graph of G if they span a triangle in G. In this paper we show: The Four Color Theorem can be equivalently stated in terms of anti-Gallai graphs; the problems...
متن کاملGallai and Anti-gallai Graphs of a Graph
The paper deals with graph operators—the Gallai graphs and the anti-Gallai graphs. We prove the existence of a finite family of forbidden subgraphs for the Gallai graphs and the anti-Gallai graphs to be H-free for any finite graph H. The case of complement reducible graphs—cographs is discussed in detail. Some relations between the chromatic number, the radius and the diameter of a graph and it...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 1992
ISSN: 0209-9683,1439-6912
DOI: 10.1007/bf01305228